BMR Freeness for Icosahedral Family

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The BMR freeness conjecture for the 2-reflection groups

We prove the freeness conjecture of Broué, Malle and Rouquier for the Hecke algebras associated to most of the primitive complex 2-reflection groups with a single conjugacy class of reflections.

متن کامل

Computation Time In BMR

Figure 13: Running time of the assembly DGEMM routine vs that of the C routine of the S-method coupled with DGEMM on single processor. MINDIM=100 for the S-method. Strassen's algorithm has been presented and compared with other parallel matrix multiplication algorithms. On the Intel iPSC/860, the BMR-Strassen method coupled with assembly BLAS routines o ers the fastest approach to matrix multip...

متن کامل

Supersolvability and Freeness for ψ-Graphical Arrangements

Let G be a simple graph on the vertex set {v1, . . . , vn} with edge set E. Let K be a field. The graphical arrangement AG in K n is the arrangement xi − xj = 0, vivj ∈ E. An arrangement A is supersolvable if the intersection lattice L(c(A)) of the cone c(A) contains a maximal chain of modular elements. The second author has shown that a graphical arrangement AG is supersolvable if and only if ...

متن کامل

Testing Pattern-Freeness

Understanding the local behaviour of structured multi-dimensional data is a fundamental problem in various areas of computer science. As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically property testers, to understand local properties of the data. We focus on the natural local problem of testing pattern freeness: given a large d-dimensional...

متن کامل

Distributedly Testing Cycle-Freeness

We tackle local distributed testing of graph properties. This framework is well suited to contexts in which data dispersed among the nodes of a network can be collected by some central authority (like in, e.g., sensor networks). In local distributed testing, each node can provide the central authority with just a few information about what it perceives from its neighboring environment, and, bas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2018

ISSN: 1058-6458,1944-950X

DOI: 10.1080/10586458.2018.1455072